Strong Normalizability as a Finiteness Structure via the Taylor Expansion of \lambda λ -terms
نویسندگان
چکیده
In the folklore of linear logic, a common intuition is that the structure of finiteness spaces, introduced by Ehrhard, semantically reflects the strong normalization property of cut-elimination. We make this intuition formal in the context of the non-deterministic λ-calculus by introducing a finiteness structure on resource terms, which is such that a λ-term is strongly normalizing iff the support of its Taylor expansion is finitary. An application of our result is the existence of a normal form for the Taylor expansion of any strongly normalizable non-deterministic λ-term.
منابع مشابه
Strong Normalizability as a Finiteness Structure
In the folklore of linear logic, a common intuition is that the structure of finiteness spaces, introduced by Ehrhard, semantically reflects the strong normalization property of cut-elimination. We make this intuition formal in the context of the non-deterministic λ-calculus by introducing a finiteness structure on resource terms, which is such that a λ-term is strongly normalizing iff the supp...
متن کاملNormalizing the Taylor expansion of non-deterministic {\lambda}-terms, via parallel reduction of resource vectors
It has been known since Ehrhard and Regnier’s seminal work on the Taylor expansion of λ-terms that this operation commutes with normalization: the expansion of a λ-term is always normalizable and its normal form is the expansion of the Böhm tree of the term. We generalize this result to the non-uniform setting of the algebraic λ-calculus, i.e., λ-calculus extended with linear combinations of te...
متن کاملA characterization of the Taylor expansion of λ-terms∗
The Taylor expansion of λ-terms, as introduced by Ehrhard and Regnier, expresses a λ-term as a series of multi-linear terms, called simple terms, which capture bounded computations. Normal forms of Taylor expansions give a notion of infinitary normal forms, refining the notion of Böhm trees in a quantitative setting. We give the algebraic conditions over a set of normal simple terms which chara...
متن کاملTaylor Expansion, β-Reduction and Normalization
We introduce a notion of reduction on resource vectors, i.e. infinite linear combinations of resource λ-terms. The latter form the multilinear fragment of the differential λ-calculus introduced by Ehrhard and Regnier, and resource vectors are the target of the Taylor expansion of λ-terms. We show that the reduction of resource vectors contains the image, through Taylor expansion, of β-reduction...
متن کاملContinuous Normalization for the Lambda-Calculus and Gödel’s T
Building on previous work by Mints, Buchholz and Schwichtenberg, a simplified version of continuous normalization for the untyped λ-calculus and Gödel’s T is presented and analyzed in the coalgebraic framework of non-wellfounded terms with so-called repetition constructors. The primitive recursive normalization function is uniformly continuous w.r.t. the natural metric on non-wellfounded terms....
متن کامل